Can a student learn optimally from two different teachers?NEIROTTI, J. P.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 1, issn 1751-8113, 015101.1-015101.16Article

Parallel strategy for optimal learning in perceptronsNEIROTTI, J. P.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 12, issn 1751-8113, 125101.1-125101.15Article

Optimal polygon placement by translationSUDEBKUMAR PRASANT PAL; BHASKAR DASGUPTA; VENI MADHAVAN, C. E et al.International journal of computer mathematics. 1994, Vol 52, Num 3-4, pp 139-148, issn 0020-7160Article

An optimal algorithm for computing a minimum nested nonconvex polygonSUBIR KUMAR GHOSH; ANIL MAHESHWARI.Information processing letters. 1990, Vol 36, Num 6, pp 277-280, issn 0020-0190, 4 p.Article

The optimal PAC algorithmWARMUTH, Manfred K.Lecture notes in computer science. 2004, pp 641-642, issn 0302-9743, isbn 3-540-22282-0, 2 p.Conference Paper

Randomized single-target hot-potato routingBEN AROYA, I; NEWMAN, I; SCHUSTER, A et al.Journal of algorithms (Print). 1997, Vol 23, Num 1, pp 101-120, issn 0196-6774Article

X² cryptanalysis of the SEAL encryption algorithmHANDSCHUH, H; GILBERT, H.Lecture notes in computer science. 1997, pp 1-12, issn 0302-9743, isbn 3-540-63247-6Conference Paper

A greedy algorithm to determine the number of transporters in a cyclic electroplating processARMSTRONG, R; GU, S; LEI, L et al.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 460-474, isbn 0-7803-2535-4, 3VolConference Paper

Algorithms for optimal protein structure alignmentPOLEKSIC, Aleksandar.Bioinformatics (Oxford. Print). 2009, Vol 25, Num 21, pp 2751-2756, issn 1367-4803, 6 p.Article

A Note on Trees, Tables, and AlgorithmsGODDARD, Wayne; HEDETNIEMI, Stephen T.Networks (New York, NY). 2009, Vol 53, Num 2, pp 184-190, issn 0028-3045, 7 p.Article

Sorting on a massively parallel system using a library of basic primitives : Modeling and experimental resultsWACHSMANN, A; WANKA, R.Lecture notes in computer science. 1997, pp 399-408, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Randomness in distribution protocolsBLUNDO, C; DE SANTIS, A; VACCARO, U et al.Information and computation (Print). 1996, Vol 131, Num 2, pp 111-139, issn 0890-5401Article

International symposium on optimal algorithms: [selected papers], Varna, Bulgaria, May 29-June 2, 1989DJIDJEV, Hristo N.Lecture notes in computer science. 1989, Vol 401, issn 0302-9743, VI-308 p. [314 p.]Conference Proceedings

An optimal algorithm for the continuous/discrete weighted 2-center problem in treesBEN-MOSHE, Boaz; BHATTACHARYA, Binay; QIAOSHENG SHI et al.Lecture notes in computer science. 2006, pp 166-177, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

External inverse pattern matchingGASIENIEC, L; INDYK, P; KRYSTA, P et al.Lecture notes in computer science. 1997, pp 90-101, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Intractability of assembly sequencing: Unit disks in the planeGOLDWASSER, M; MOTWANI, R.Lecture notes in computer science. 1997, pp 307-320, issn 0302-9743, isbn 3-540-63307-3Conference Paper

On-line algorithms for path selection in a nonblocking networkARORA, S; LEIGHTON, F. T; MAGGS, B. M et al.SIAM journal on computing (Print). 1996, Vol 25, Num 3, pp 600-625, issn 0097-5397Article

Approximation algorithms for the fixed-topology phylogenetic number problemCRYAN, M; GOLDBERG, L. A; PHILLIPS, C. A et al.Lecture notes in computer science. 1997, pp 130-149, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Implementing (nondeterministic) parallel assignmentsGRANDI, P.Information processing letters. 1996, Vol 58, Num 4, pp 177-179, issn 0020-0190Article

Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a TreeSUNG KWON KIM.IEICE transactions on information and systems. 2011, Vol 94, Num 6, pp 1325-1328, issn 0916-8532, 4 p.Article

Capacitated disassembly scheduling : Minimizing the number of products disassembledKIM, Jun-Gyu; JEON, Hyong-Bae; KIM, Hwa-Joong et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part IV, 538-547Conference Paper

Extending the accommodating functionBOYAR, Joan; FAVRHOLDT, Lene M; LARSEN, Kim S et al.Lecture notes in computer science. 2002, pp 87-96, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

An approximately optimal algorithm for finding an extremum for a certain class of functionsKOROTCHENKO, A. G.Computational mathematics and mathematical physics. 1996, Vol 36, Num 5, pp 577-584, issn 0965-5425Article

Some new results concerning three counterfeit coins problemBOSNJAK, I.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 81-85, issn 0166-218XArticle

The complexity of an optimal algorithm for the generalized tower of Hanoi problemVAN ZANTEN, A. J.International journal of computer mathematics. 1990, Vol 36, Num 1-2, pp 1-8, issn 0020-7160Article